Validity of Router Responses for IP Aliases Resolution
نویسندگان
چکیده
In order to obtain close-to-reality Internet maps, IP aliases resolution allows identifying IP addresses belonging to the same router. Mainly, active probing is used for IP aliases resolution following direct and indirect schemes. Also, different types of probe packets are used (ICMP, UDP, etc.) focusing on different header fields and characteristics of IP and higher layers. Responsiveness of routers is different not only in the number of response packets received, but also in the validity of those packets to be used in IP aliases identification. Therefore, specific behavior of routers generating those response packets can decide the success or failure of specific IP aliases resolution methods. In this paper, an in-depth analysis of router behaviors is provided considering not only router responsiveness, but also the validity of those responses to be used in IP aliases resolution. Our results show that although responsiveness is better for indirect probing, direct probing with ICMP Echo probe packets and IPID-based behavior provide the best identification ratio for IP aliases resolution.
منابع مشابه
How to Resolve IP Aliases
To construct accurate Internet maps, traceroute-based mapping efforts must group interface IP addresses into routers, a task known as alias resolution. In this paper, we introduce two new alias resolution approaches based on inference to handle addresses that cannot be resolved by existing methods based on probe measurements. The first decodes the DNS names assigned by the ISP to recognize the ...
متن کاملUAv6: Alias Resolution in IPv6 Using Unused Addresses
As the IPv6 Internet grows, alias resolution in IPv6 becomes more important. Traditional IPv4 alias resolution techniques such as Ally do not work for IPv6 because of protocol differences. Recent techniques adopted specifically for IPv6 have shown promise, but utilize source routing, which has since been deprecated, or rely upon sequential fragment identifiers supported on only a third of route...
متن کاملInternet Measurements with Prespecified Timestamps
Countless organizations and individuals depend on the Internet daily for their critical communications. Internet measurement aims to provide tools to allow these users to better understand the network, achieve better performance, and identify problems they may encounter. However, despite the diverse set of tools available, several basic properties of topology, routing, and performance remain ch...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل